Primes Differing by a Fixed Integer
نویسندگان
چکیده
منابع مشابه
Iterations of Integer Polynomial Maps Modulo Primes
In this elementary note we discuss some questions related to the behavior of iterations of polynomial maps with integer coefficients modulo primes. In particular, we introduce three examples of such maps that have interesting dynamical properties. Several open questions are stated and discussed.
متن کاملInteger Partitions with Fixed Subsums
Given two positive integers m ≤ n, we consider the set of partitions λ = (λ1, . . . , λ`, 0, . . . ), λ1 ≥ λ2 ≥ . . . , of n such that the sum of its parts over a fixed increasing subsequence (aj) is m: λa1 + λa2 + · · · = m. We show that the number of such partitions does not depend on n if m is either constant and small relatively to n or depend on n but is close to its largest possible value...
متن کاملA Mixed Integer Programming Formulation for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem
The heterogeneous fixed fleet open vehicle routing problem (HFFOVRP) is one of the most significant extension problems of the open vehicle routing problem (OVRP). The HFFOVRP is the problem of designing collection routes to a number of predefined nodes by a fixed fleet number of vehicles with various capacities and related costs. In this problem, the vehicle doesn’t return to the depot after se...
متن کاملFaster integer multiplication using plain vanilla FFT primes
Assuming a conjectural upper bound for the least prime in an arithmetic progression, we show that n-bit integers may be multiplied in O(n logn 4 ∗ n) bit operations.
متن کاملFast Integer Programming in Fixed Dimension
It is shown that the optimum of an integer program in fixed dimension with a fixed number of constraints can be computed with O(s) basic arithmetic operations, where s is the binary encoding length of the input. This improves on the quadratic running time of previous algorithms, which are based on Lenstra’s algorithm and binary search. It follows that an integer program in fixed dimension, whic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1981
ISSN: 0025-5718
DOI: 10.2307/2007447